翻訳と辞書 |
Parity benchmark : ウィキペディア英語版 | Parity benchmark
Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered difficult because: #a very simple artificial neural network cannot solve it, and #all inputs need to be considered and a change to any one of them changes the answer. ==References==
* (Foundations of Genetic Programming )
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Parity benchmark」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|